Class-graph Inference for Adaptive Programs - X X X X X X X X X X Z
نویسنده
چکیده
Software generators can adapt components to changes in the architectures in which the components operate. The idea is to keep the architecture description separate and let the software generator mix it with speciications of each component. Adaptation is done by regeneration: when the architecture changes, the components are regenerated. A software component will usually be written with a particular architecture in mind. This raises the question: how much has it committed to the particular structure of that architecture? To put it in a nutshell: How exible is a given software component? In this paper we study this question in the setting of Lieberherr's adaptive programming. Lieberherr uses class graphs as the architecture and so-called adaptive programs as the software components. We present a polynomial-time class-graph inference algorithm for adaptive programs. The algorithm builds a representation of the set of class graphs with which a given adaptive program can work. It also decides if the set is non-empty, and if so it computes a particularly simple graph in the solution set. Several toy programs have been processed by a prototype implementation of the algorithm.
منابع مشابه
The graph of equivalence classes and Isoclinism of groups
Let $G$ be a non-abelian group and let $Gamma(G)$ be the non-commuting graph of $G$. In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$, where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$. We introduce a new graph determined ...
متن کاملThe edge tenacity of a split graph
The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...
متن کاملThe automorphism group of the reduced complete-empty $X-$join of graphs
Suppose $X$ is a simple graph. The $X-$join $Gamma$ of a set ofcomplete or empty graphs ${X_x }_{x in V(X)}$ is a simple graph with the following vertex and edge sets:begin{eqnarray*}V(Gamma) &=& {(x,y) | x in V(X) & y inV(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}.end{eqnarray*}The $X-$join graph $Gamma$ is said to be re...
متن کاملTHE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G
To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin V}$ and two vertices ${x,y},{z,w}in G_{triangle,square}$ are adjacent if and only if ${x,z},{x,w},{y,z},{y,w}in Vcup E$. The graph $G_{triangle,square}$ is called the $(triangle,square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the ...
متن کاملConnections between C(X) and C(Y), where Y is a subspace of X
In this paper, we introduce a method by which we can find a close connection between the set of prime $z$-ideals of $C(X)$ and the same of $C(Y)$, for some special subset $Y$ of $X$. For instance, if $Y=Coz(f)$ for some $fin C(X)$, then there exists a one-to-one correspondence between the set of prime $z$-ideals of $C(Y)$ and the set of prime $z$-ideals of $C(X)$ not containing $f$. Moreover, c...
متن کامل$k$-power centralizing and $k$-power skew-centralizing maps on triangular rings
Let $mathcal A$ and $mathcal B$ be unital rings, and $mathcal M$ be an $(mathcal A, mathcal B)$-bimodule, which is faithful as a left $mathcal A$-module and also as a right $mathcal B$-module. Let ${mathcal U}=mbox{rm Tri}(mathcal A, mathcal M, mathcal B)$ be the triangular ring and ${mathcal Z}({mathcal U})$ its center. Assume that $f:{mathcal U}rightarrow{mathcal U}$ is...
متن کامل